A Performance Enhanced and Cost Effective Deadlock Recovery Scheme for Adaptive Wormhole Routed Networks
نویسنده
چکیده
Deadlock free routing of messages is a challenge for the performance of directly connected network systems. Communication among the nodes of a directly connected multicomputer system is via message exchange. The wormhole routing is perceived as the best switching technique in directly connected systems. The technique suffers the challenges like deadlock avoidance. Deadlock recovery faces cost of implications of deadlock detection mechanism and consumes additional resources. The proposed work suggests a deadlock recovery scheme on reduced cost, with fewer resources, reduced complexity and enhanced performance. Key WordsSwitching, Wormhole routing, flit buffer, multicomputer, interconnected Network, Cost effective.
منابع مشابه
Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent
This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-recovery which relaxes the sequential recovery requirement for simultaneous recovery from deadlocks. The proposed extension to Disha does not necessitate any additional res...
متن کاملDeadlock Detection and Recovery for True Fully Adaptive Routing in Regular Wormhole Networks
Deadlock detection and recovery-based routing schemes for wormhole networks have gained attraction because unlike deadlock avoidance-based schemes, they do not restrict routing adaptability. In order to alleviate the overhead of running a recovery procedure, the studies on deadlock detection have focused on the accuracy of deadlock detection, trying to reduce the number of false detections. Thi...
متن کاملAn Optimistic Deadlock Free Adaptive Wormhole Routing Algorithm for Two Dimensional Meshes
This paper proposes a general scheme for deadlock recovery based adaptive wormhole routing by considering a minimal set of additional buffers called recovery buffers. This scheme is then applied to deadlock recovery. When deadlock occurs in adaptive wormhole routing, the scheme routes the deadlocked message through a special recovery network, constructed from a sub set of the available network ...
متن کاملTree-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks with Hamiltonian Path
Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In our previous work on wormhole star graph networks routing, we proposed a path-base...
متن کاملA New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
Second generation multicomputers use wormhole routing, allowing a very low channel setup time and drastically reducing the dependency between network latency and internode distance. Deadlock-free routing strategies have been developed, allowing the implementation of fast hardware routers that reduce the communicat ion bottleneck. Also, adaptive routing algorithms with deadlock-avoidance or dead...
متن کامل